全文获取类型
收费全文 | 1624篇 |
免费 | 160篇 |
国内免费 | 98篇 |
专业分类
化学 | 148篇 |
晶体学 | 3篇 |
力学 | 63篇 |
综合类 | 51篇 |
数学 | 1288篇 |
物理学 | 329篇 |
出版年
2024年 | 1篇 |
2023年 | 15篇 |
2022年 | 34篇 |
2021年 | 31篇 |
2020年 | 42篇 |
2019年 | 52篇 |
2018年 | 41篇 |
2017年 | 52篇 |
2016年 | 56篇 |
2015年 | 39篇 |
2014年 | 67篇 |
2013年 | 144篇 |
2012年 | 62篇 |
2011年 | 82篇 |
2010年 | 105篇 |
2009年 | 102篇 |
2008年 | 130篇 |
2007年 | 120篇 |
2006年 | 104篇 |
2005年 | 63篇 |
2004年 | 80篇 |
2003年 | 72篇 |
2002年 | 53篇 |
2001年 | 60篇 |
2000年 | 41篇 |
1999年 | 25篇 |
1998年 | 37篇 |
1997年 | 19篇 |
1996年 | 24篇 |
1995年 | 14篇 |
1994年 | 21篇 |
1993年 | 15篇 |
1992年 | 9篇 |
1991年 | 13篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1982年 | 11篇 |
1981年 | 5篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1882条查询结果,搜索用时 37 毫秒
21.
This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in and , the families of all trees and caterpillars, respectively, of order . We begin by establishing a powerful tool called the Gluing Lemma, which is used to prove several of our main results. In particular, we show that if is an optimal tree in or for , then every leaf of is adjacent to a vertex of degree at least . We also use the Gluing Lemma to answer an open question of Jamison and to provide a conceptually simple proof of Jamison's result that the path has minimum mean subtree order among all trees of order . We prove that if is optimal in , then the number of leaves in is and that if is optimal in , then the number of leaves in is . Along the way, we describe the asymptotic structure of optimal trees in several narrower families of trees. 相似文献
22.
23.
《Journal of computational and graphical statistics》2013,22(3):464-486
In recent years, hierarchical model-based clustering has provided promising results in a variety of applications. However, its use with large datasets has been hindered by a time and memory complexity that are at least quadratic in the number of observations. To overcome this difficulty, this article proposes to start the hierarchical agglomeration from an efficient classification of the data in many classes rather than from the usual set of singleton clusters. This initial partition is derived from a subgraph of the minimum spanning tree associated with the data. To this end, we develop graphical tools that assess the presence of clusters in the data and uncover observations difficult to classify. We use this approach to analyze two large, real datasets: a multiband MRI image of the human brain and data on global precipitation climatology. We use the real datasets to discuss ways of integrating the spatial information in the clustering analysis. We focus on two-stage methods, in which a second stage of processing using established methods is applied to the output from the algorithm presented in this article, viewed as a first stage. 相似文献
24.
Invented in the 1970s, the Suffix Tree (ST) is a data structure that indexes all substrings of a text in linear space. Although more space demanding than other indexes, the ST remains likely an inspiring index because it represents substrings in a hierarchical tree structure. Along time, STs have acquired a central position in text algorithmics with myriad of algorithms and applications to for instance motif discovery, biological sequence comparison, or text compression. It is well known that different words can lead to the same suffix tree structure with different labels. Moreover, the properties of STs prevent all tree structures from being STs. Even the suffix links, which play a key role in efficient construction algorithms and many applications, are not sufficient to discriminate the suffix trees of distinct words. The question of recognising which trees can be STs has been raised and termed Reverse Engineering on STs. For the case where a tree is given with potential suffix links, a seminal work provides a linear time solution only for binary alphabets. Here, we also investigate the Reverse Engineering problem on ST with links and exhibit a novel approach and algorithm. Hopefully, this new suffix tree characterisation makes up a valuable step towards a better understanding of suffix tree combinatorics. 相似文献
25.
In this work, a hierarchical variant of a boundary element method and its use in Stokes flow around three-dimensional rigid bodies in steady regime is presented. The proposal is based on the descending hierarchical low-order and self-adaptive algorithm of Barnes-Hut, and it is used in conjunction with an indirect boundary integral formulation of second class, whose source term is a function of the undisturbed velocity. The solution field is the double layer surface density, which is modified in order to complete the eigenvalue spectrum of the integral operator. In this way, the rigid modes are eliminated and both a non-zero force and a non-null torque on the body could be calculated. The elements are low order flat triangles, and an iterative solution by generalized minimal residual (GMRES) is used. Numerical examples include cases with analytical solutions, bodies with edges and vertices, or with intricate shapes. The main advantage of the presented technique is the possibility of considering a greater number of degrees of freedom regarding traditional collocation methods, due to the decreased demand of main memory and the reduction in the computation times. 相似文献
26.
27.
Edwin van der Werf Yonky Indrajaya Frits Mohren Ekko C. van Ierland 《Natural Resource Modeling》2019,32(4)
Using insights from the forest ecology literature, we analyze the effect of injured trees on stand composition and carbon stored in above‐ground biomass and the implications for forest management decisions. Results from a Faustmann model with data for a tropical forest on Kalimantan show that up to 50% of the basal area of the stand before harvest can consist of injured trees. Considering injured trees leads to an increase in the amount of carbon in above‐ground biomass of up to 165%. These effects are larger under reduced impact logging than under conventional logging. The effects on land expectation value and cutting cycle are relatively small. The results suggest that considering injured trees in models for tropical forest management is important for the correct assessment of the potential of financial programs to store carbon and conserve forest ecosystem services in managed tropical forests, such as reducing emissions from deforestation and forest degradation and payment for ecosystem services. Recommendations for Resource Managers
- Considering the role of injured trees is important for managing tropical forests
- These trees can cover up to 50% of basal area and contain more than 50% of the carbon stored in above‐ground biomass
- Reduced impact logging leads to a larger basal area of injured trees and more carbon stored in injured trees than conventional logging
- Injured trees play an important role when assessing the potential for carbon storage in the context of payment for forest ecosystem services.
28.
In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. 相似文献
29.
Lan Lei Xianya Geng Shuchao Li Yingjun Peng Yuantian Yu 《International journal of quantum chemistry》2019,119(24):e26044
Let denote a molecular graph of linear [n] phenylene with n hexagons and n squares, and let the Möbius phenylene chain be the graph obtained from the by identifying the opposite lateral edges in reversed way. Utilizing the decomposition theorem of the normalized Laplacian characteristic polynomial, we study the normalized Laplacian spectrum of , which consists of the eigenvalues of two symmetric matrices ℒ R and ℒ Q of order 3n. By investigating the relationship between the roots and coefficients of the characteristic polynomials of the two matrices above, we obtain an explicit closed-form formula of the multiplicative degree-Kirchhoff index as well as the number of spanning trees of . Furthermore, we determine the limited value for the quotient of the multiplicative degree-Kirchhoff index and the Gutman index of . 相似文献
30.